A Generic NP-hardness Proof for a Variant of Graph Coloring
نویسنده
چکیده
In this note, a direct proof is given of the NP-completeness of a variant of Graph Coloring, i.e., a generic proof is given, similar to the proof of Cook of the NPcompleteness of Satisfiability. Then, transformations from this variant of Graph Coloring to Independent Set and to Satisfiability are given. These proofs could be useful in an educational setting, where basics of the theory of NP-completeness must be explained to students whose background in combinatorial optimisation and/or graph theory is stronger than their background in logic. In addition, I believe that the proof given here is slightly easier than older generic proofs of NP-completeness.
منابع مشابه
Hardness of Approximate Coloring
The graph coloring problem is a notoriously hard problem, for which we do not have efficient algorithms. A coloring of a graph is an assignment of colors to its vertices such that the end points of every edge have different colors. A k-coloring is a coloring that uses at most k distinct colors. The graph coloring problem is to find a coloring that uses the minimum number of colors. Given a 3-co...
متن کاملOn the Hardness of 4-Coloring a 3-Colorable Graph
We give a new proof showing that it is NP-hard to color a 3-colorable graph using just four colors. This result is already known [18], but our proof is novel as it does not rely on the PCP theorem, while the one in [18] does. This highlights a qualitative difference between the known hardness result for coloring 3-colorable graphs and the factor n hardness for approximating the chromatic number...
متن کاملThe Hardness of 3 - Uniform Hypergraph Coloring
We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n1/5) colors. Our result immediately implies that for any constants k ≥ 3 and c2 > c1 > 1, coloring a k-uniform c1-colorable hypergraph with c2 colors is NP-hard; the case k = 2, however, remains wide open. This is the first hardness re...
متن کاملA short proof of the NP-completeness of minimum sum interval coloring
In the minimum sum coloring problem we have to assign positive integers to the vertices of a graph in such a way that neighbors receive different numbers and the sum of the numbers is minimized. Szkalicki [9] has shown that minimum sum coloring is NP-hard for interval graphs. Here we present a simpler proof of this result.
متن کامل$2^{(\log N)^{1/4-o(1)}}$ Hardness for Hypergraph Coloring
We show that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with 2 1/8−o(1) colors, where N is the number of vertices. There has been much focus on hardness of hypergraph coloring recently. In [17], Guruswami, H̊astad, Harsha, Srinivasan and Varma showed that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with 2 Ω( √ log log N) colors. Their result is obtained by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. UCS
دوره 7 شماره
صفحات -
تاریخ انتشار 2001